On computing the 2-vertex-connected components of directed graphs
نویسندگان
چکیده
منابع مشابه
On computing the $2$-vertex-connected components of directed graphs
In this paper we consider the problem of computing the 2-vertex-connected components (2-vccs) of directed graphs. We present two new algorithms for solving this problem. The first algorithm runs in O(mn) time, the second in O(nm) time. Furthermore, we show that the old algorithm of Erusalimskii and Svetlov runs inO(nm) time. In this paper, we investigate the relationship between 2-vccs and domi...
متن کاملEnumerating k-Vertex Connected Components in Large Graphs
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network topology analysis. Most of existing cohesive subgraph metrics can guarantee good structural properties but may cause the free-rider effect. Here, by free-rider effect, we mean that some irrelevant subgraphs are combi...
متن کامل2-Vertex Connectivity in Directed Graphs
We complement our study of 2-connectivity in directed graphs [7], by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. We also say that v and w are vertex-resilient if the removal of any vertex dif...
متن کاملComputing the 2-blocks of directed graphs
Let G be a directed graph. A 2-directed block in G is a maximal vertex set C ⊆ V with |C2d| ≥ 2 such that for each pair of distinct vertices x, y ∈ C, there exist two vertex-disjoint paths from x to y and two vertex-disjoint paths from y to x in G. In contrast to the 2-vertex-connected components of G, the subgraphs induced by the 2-directed blocks may consist of few or no edges. In this paper ...
متن کاملVertex Covers and Connected Vertex Covers in 3-connected Graphs
A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively. A connected vertex cover of a graph G is a vertex cover of G such that the subgraph G[N] induced by N of G is connected. The minimum vertex cover problem (VCP) is the problem of finding a vertex cover of mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.10.001